|
In optimization theory, semi-infinite programming (SIP) is an optimization problem with a finite number of variables and an infinite number of constraints, or an infinite number of variables and a finite number of constraints. In the former case the constraints are typically parameterized.〔 * * M. A. Goberna and M. A. López, ''Linear Semi-Infinite Optimization'', Wiley, 1998. * 〕 ==Mathematical formulation of the problem== The problem can be stated simply as: : : :: where : : : : SIP can be seen as a special case of bilevel programs in which the lower-level variables do not participate in the objective function. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Semi-infinite programming」の詳細全文を読む スポンサード リンク
|